Almost all primes satisfy the Atkin–Serre conjecture and are not extremal
نویسندگان
چکیده
Let $$f(z)=\sum _{n=1}^{\infty } a_f(n)e^{2\pi i n z}$$ be a non-CM holomorphic cuspidal newform of trivial nebentypus and even integral weight $$k\ge 2$$ . Deligne’s proof the Weil conjectures shows that $$|a_f(p)|\le 2p^{\frac{k-1}{2}}$$ for all primes p. We prove 100% p $$ 2p^{\frac{k-1}{2}}{\log \log p}/{\sqrt{\log p}}<|a_f(p)|<\lfloor 2p^{\frac{k-1}{2}}\rfloor .$$ Our gives an effective upper bound size exceptional set. The lower Atkin–Serre conjecture is satisfied primes, $$|a_f(p)|$$ as large possible (i.e., extremal f) 0% primes. proofs use form Sato–Tate proved by second author, which relies on recent automorphy symmetric powers f due to Newton Thorne.
منابع مشابه
ARE PSEUDOPRIMES FOR ALMOST ALL PRIMES p
It was proven by Emma Lehmer that for almost all odd primes p, F2p is a Fibonacci pseudoprime. In this paper, we generalize this result to Lucas sequences {Uk}. In particular, we find Lucas sequences {Uk} for which either U2p is a Lucas pseudoprime for almost all odd primes p or Up is a Lucas pseudoprime for almost all odd primes p.
متن کاملAlmost all webs are not rank-perfect
Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]. Providing a decent linear description of the stable set polytopes of claw-free graphs is a long-standing problem [9]. Ben Rebea conjectured a description for quasi-line graphs, see [12]; Chudnovsky and Seymour [2] v...
متن کاملPrimes in Almost All Short Intervals
It is well known that Huxley’s density estimates [5] for the zeros of the Riemann zeta-function yield J(x, h) = o(xh2(log x)−2), but only for h ≥ x1/6(log x) , for some C > 0. The weaker result with h ≥ x1/6+ε is proved in Saffari and Vaughan [8], Lemma 5, and in [13], where an identity of Heath-Brown (Lemma 1 of [3]) is used. This paper is inspired by Heath-Brown’s extension [4] of Huxley’s Th...
متن کاملHow hard is it to satisfy (almost) all roommates?
The classic Stable Roommates problem (which is the non-bipartite generalization of the well-known Stable Marriage problem) asks whether there is a stable matching for a given set of agents, i.e. a partitioning of the agents into disjoint pairs such that no two agents induce a blocking pair. Herein, each agent has a preference list denoting who it prefers to have as a partner, and two agents are...
متن کاملOn the symmetry of primes in almost all short intervals
– In this paper we study the symmetry of primes in almost all short intervals; by elementary methods (based on the Large Sieve) we give, for h x log x (c > 0, suitable), a non-trivial estimate for the mean-square (over N < x ≤ 2N) of an average of “symmetry sums”; these sums control the symmetry of the von-Mangoldt function in short intervals around x. We explicitly remark that our results are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Research in number theory
سال: 2021
ISSN: ['2363-9555', '2522-0160']
DOI: https://doi.org/10.1007/s40993-021-00258-w